Ident. | Authors (with country if any) | Title |
---|
001425 |
Pierre Lescanne [France] | Les krachs sont rationnels |
001620 |
Pierre Lescanne [France] | Common Knowledge Logic in a Higher Order Proof Assistant |
001656 |
Pierre Lescanne [France] | A Simple Case of Rationality of Escalation |
001D80 |
Pierre Lescanne [France] ; Matthieu Perrinel [France] | “Backward” coinduction, Nash equilibrium and the rationality of escalation |
002678 |
Silvia Ghilezan [Serbie] ; Jelena Iveti [Serbie] ; Pierre Lescanne [France] ; Silvia Likavec [Italie] | Intersection Types for the Resource Control Lambda Calculi |
004C32 |
Pierre Lescanne [France] | Mechanizing common knowledge logic using COQ |
005290 |
Daniel J. Dougherty [États-Unis] ; Pierre Lescanne [France] ; Luigi Liquori | Addressed term rewriting systems: application to a typed object calculus |
007894 |
Dan Dougherty [États-Unis] ; Pierre Lescanne [France] | Reductions, intersection types, and explicit substitutions |
009822 |
Frederic Lang ; Pierre Lescanne [France] ; Luigi Liquori ; Dan Dougherty ; Rose Kristoffer | A Generic Object-Calculus Based on Addressed Term Rewriting Systems |
00BE81 |
Z. Benaissa ; Daniel Briaud ; Pierre Lescanne [France] ; J. Rouyer-Degli | Lambda upsilon, A Calculus of Explicit Substitutions which Preserves Strong Normalisation |
00BF09 |
Pierre Lescanne [France] | La science informatique en Lorraine |
00BF26 |
Zine-El-Abidine Benaissa [France] ; Daniel Briaud [France] ; Pierre Lescanne [France] ; Jocelyne Rouyer-Degli [France] | λν, a calculus of explicit substitutions which preserves strong normalisation |
00BF28 |
Gregory Kucherov [France] ; Pierre Lescanne [France] ; Peter Mosses [Danemark] | Valentin Antimirov (1961–1995) |
00C010 |
Pierre Lescanne [France] | The lambda calculus as an abstract data type |
00C054 |
Zine-El-Abidine Benaissa [France] ; Pierre Lescanne [France] ; Kristoffer H. Rose [Danemark] | Modeling sharing and recursion for weak reduction strategies using explicit substitution |
00C136 |
G. Kucherov [France] ; Pierre Lescanne [France] ; P. Mosses [Danemark] | Valentin Antimirov (1961-1995) |
00C308 |
B. Chetali ; Pierre Lescanne [France] | Formal Verification of a Protocol for Communications over Faulty Channels |
00C374 |
Pierre Lescanne [France] ; J. Rouyer-Degli | Explicit Substitutions with de Bruijn's Levels |
00C413 |
Z. Benaissa ; Pierre Lescanne [France] | Triad Machine ; A General Computational Model for the Description of Abstract Machines |
00C531 |
Pierre Lescanne [France] | Termination of rewrite systems by elementary interpretations |
00C698 |
Pierre Lescanne [France] | Termination of rewrite systems by elementary interpretations |
00C756 |
Pierre Lescanne [France] ; Jocelyne Rouyer-Degli [France] | Explicit substitutions with de bruijn's levels |
00C970 |
J. Rouyer ; Pierre Lescanne [France] | Verification and Programming of First-order Unification, in the Calculus of Constructions with Inductive Type |
00CA28 |
Z. Benaissa ; Pierre Lescanne [France] | A Suitable Environments for an Efficient Calculus of Explicit Substitutions |
00CA65 |
Pierre Lescanne [France] | From λσ to λ\upsilon, a Journey through Calculi of Explicit Substitutions |
00CB51 |
Pierre Lescanne [France] | An Introduction to ORME |
00CB73 |
Pierre Lescanne [France] | On Termination of one Rule Rewrite Systems |
00CC11 |
Pierre Lescanne [France] ; J. Rouyer-Degli | The Calculus of Explicit Substitutions λ\upsilon |
00D259 |
Pierre Lescanne [France] | Well Rewrite Orderings and Well Quasi-Orderings |
00D410 |
B. Chetali ; Pierre Lescanne [France] | An Exercice in LP : The Proof of a Non Restoring Division Circuit |
00D412 |
E. A. Cichon ; Pierre Lescanne [France] | Polynomial Interpretations and the Complexity of Algorithms |
00D467 |
J. Hsiang ; H. Kirchner ; Pierre Lescanne [France] ; M. Rusinowitch | The Term Rewriting Approach to Automated Theorem Proving |
00D476 |
Pierre Lescanne [France] | Termination of Rewrite Systems by Elementary Interpretations |
00D631 |
Pierre Lescanne [France] | Termination of rewrite systems by elementary interpretations |
00D649 |
Adam Cichon [France] ; Pierre Lescanne [France] | Polynomial interpretations and the complexity of algorithms |
00D735 |
Pierre Lescanne [France] | Well Rewrite Orderings and Well Quasi-Orderings |
00D806 |
Pierre Lescanne [France] | Rewrite Orderings and Termination of Rewrite Systems |
00D843 |
Pierre Lescanne [France] | Proving Identities in Commutative Semigroups and Monoids : An Automaton Approach |
00D925 |
Pierre Lescanne [France] | Termination of Rewrite Systems by Elementary Interpretations |
00DA44 |
Pierre Lescanne [France] | Rewrite orderings and termination of rewrite systems |
00DC06 |
Pierre Lescanne [France] | Implementation of Completion by Transition Rules + Control : ORME |
00DC56 |
Pierre Lescanne [France] | ORME : an Implementation of Completion Procedures as Sets of Transition Rules |
00DC63 |
F. Bellegarde ; Pierre Lescanne [France] | Termination by Completion |
00DD20 |
A. Lazrek ; Pierre Lescanne [France] ; J.-J. Thiel | Tools for Proving Inductive Equalities, Relative Completeness, and \omega Completeness |
00DD32 |
M. Dauchet ; T. Heuillard ; Pierre Lescanne [France] ; S. Tison | Decidability of the Confluence of Finite Ground Term Rewrite Systems and of other Related Term Rewrite Systems |
00DE15 |
Françoise Bellegarde [États-Unis] ; Pierre Lescanne [France] | Termination by completion |
00DE26 |
Pierre Lescanne [France] | Orme an implementation of completion procedures as sets of transitions rules |
00DE27 |
Pierre Lescanne [France] | On the recursive decomposition ordering with lexicographical status and other related orderings |
00DE36 |
Pierre Lescanne [France] | Implementation of completion by transition rules + control: ORME |
00DF46 |
H. Comon ; Pierre Lescanne [France] | Equational Problems and Disunification |
00DF67 |
Pierre Lescanne [France] | Completion Procedures as Transition Rules + Control |
00E065 |
Pierre Lescanne [France] | Completion procedures as transition rules + control |
00E211 |
F. Bellegarde ; Pierre Lescanne [France] | Termination Proofs based on Transformation Techniques |
00E361 |
Pierre Lescanne [France] | Current trends in rewriting techniques and related problems |
00E434 |
Pierre Lescanne [France] ; A. Lazrek | Proving inductive properties of functions defined by rewriting systems in presence of relations among constructors. A description of an actual implementation, based on proofs by consistency |
00E448 |
A. Ben Cherifa ; Pierre Lescanne [France] | Termination of rewriting systems by polynomial. Interpretations and its implementation |
00E461 |
Pierre Lescanne [France] | Current trends in rewriting techniques and related problems |
00E516 |
Pierre Lescanne [France] ; T. Heuillard ; M. Dauchet ; S. Tison | Decidability of the confluence of ground term rewriting systems |
00E537 |
C. Kirchner ; Pierre Lescanne [France] | Solving disequations |
00E593 |
F. Bellegarde [France] ; Pierre Lescanne [France] | Transformation ordering |
00E677 |
J.-P. Jouannaud ; Pierre Lescanne [France] ; J. Mzali ; J.-L. Rémy | Présentation de l'équipe de recherche EURECA |
00E683 |
J.-P. Jouannaud ; Pierre Lescanne [France] | La réécriture |
00E693 |
A. Ben Cherifa ; I. Gnaedig ; Pierre Lescanne [France] | Les outils de preuve de terminaison dans REVE |
00E702 |
A. Ben Cherifa ; Pierre Lescanne [France] | An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial |
00E705 |
I. Gnaedig ; Pierre Lescanne [France] | Rewriting systems for proving termination of rewriting systems - Application to associative commutative rewriting |
00E713 |
P. Réty ; C. Kirchner ; H. Kirchner ; Pierre Lescanne [France] | An algorithm for unification based on narrowing |
00E716 |
I. Gnaedig ; Pierre Lescanne [France] | Proving termination of associative commutative rewriting systems by rewriting |
00E728 |
A. Lazrek ; Pierre Lescanne [France] ; J.-J. Thiel | Proving inductive equalities algorithms and implementation |
00E732 |
F. Bellegarde ; Pierre Lescanne [France] | Termination proofs based on transformation techniques |
00E762 |
F. Bellegarde ; Pierre Lescanne [France] | Transformation ordering |
00E827 |
Pierre Lescanne [France] | REVE a rewrite rule laboratory |
00E829 |
Isabelle Gnaedig [France] ; Pierre Lescanne [France] | Proving termination of associative commutative rewriting systems by rewriting |
00E853 |
Ahlem Ben Cherifa [France] ; Pierre Lescanne [France] | An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations |
00E924 |
P. Réty ; C. Kirchner ; H. Kirchner ; Pierre Lescanne [France] | NARROWER : a new algorithm for unification and its application to logic programming |
00E925 |
H. Zhang ; Pierre Lescanne [France] | Extended path of symbols ordering |
00EA42 |
Pierre Rety [France] ; Claude Kirchner [France] ; Hélène Kirchner [France] ; Pierre Lescanne [France] | NARROWER: a new algorithm for unification and its application to Logic Programming |
00EA79 |
Pierre Lescanne [France] | CLU et son déboggeur |
00EB29 |
Pierre Lescanne [France] | REVE : a rewrite rule laboratory |
00EB61 |
Pierre Lescanne [France] | Uniform termination of term rewriting systems - Recursive Decomposition Ordering with status |
00EB93 |
Pierre Lescanne [France] | Term rewriting systems and algebra |
00EC29 |
Pierre Lescanne [France] | Term Rewriting Systems and Algebra |
00ED03 |
Pierre Lescanne [France] ; J. M. Steyaert [France] | On the study data structures: Binary tournaments with repeated keys |
00ED26 |
Jean-Pierre Jouannaud [France] ; Pierre Lescanne [États-Unis] | On multiset orderings |
00ED50 |
Pierre Lescanne [France] | Modèles non déterministes de types abstraits |
00ED69 |
Pierre Lescanne [France] | Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems |
00EF61 |
Pierre Lescanne [France] | Équivalence entre la famille des ensembles réguliers et la famille des ensembles algébriques |